Minimax regret 1-sink location problem in dynamic path networks
نویسندگان
چکیده
منابع مشابه
Minimax Regret k-sink Location Problem in Dynamic Path Networks
This paper considers minimax regret 1-sink location problems in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths and constant edge capacity and the vertex supply which is nonnegative value, called weight, is unknown but only the interval of weight is known. A particular assignment of weight to each vertex is called a scenario. Under any sce...
متن کاملMinimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
This paper addresses the minimax regret sink location problem in dynamic tree networks. In our model, a dynamic tree network consists of an undirected tree with positive edge lengths and uniform edge capacity, and the vertex supply which is a positive value is unknown but only the interval of supply is known. A particular realization of supply to each vertex is called a scenario. Under any scen...
متن کاملMultiple Sink Location Problems in Dynamic Path Networks
This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform edge capacity, and positive vertex supplies. Here, each vertex supply corresponds to a set of evacuees. Then, the problem requires to find the optimal location of k sinks in a given path so that each evacuee is sent to...
متن کاملAn O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks
In this paper, we consider a sink location in a dynamic network which consists of a graph with capacities and transit times on its arcs. Given a dynamic network with initial supplies at vertices, the problem is to find a vertex v as a sink in the network such that we can send all the initial supplies to v as quickly as possible. We present an O(n log n) time algorithm for the sink location prob...
متن کاملCentroid Dynamic Sink Location for Clustered Wireless Mobile Sensor Networks
The wireless sensor network consists of three main components: a large number of small-sized sensors, a remote sink connected to the internet, and a cluster head whose existence depends on the overall network structure. The sensor in the wireless sensor network can be deployed through many ways, such as a simple model, a random walk model, and a random direction model. There were studies that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.02.010